Real-time single-pass connected components analysis algorithm
نویسندگان
چکیده
منابع مشابه
Single Pass Connected Components Analysis
The classic connected components labelling algorithm requires a minimum of 2 passes through an image. This paper presents a modification of this algorithm that allows the resolution of merged labels to be deferred. This enables the subsequent data analysis step to be combined with the labelling procedure, with the result that connected components can be analysed in a single pass by gathering da...
متن کاملSingle-pass GPU solid voxelization for real-time applications
In this paper, we present a single-pass technique to voxelize the interior of watertight 3D models with high resolution grids in realtime during a single rendering pass. Further, we develop a filtering algorithm to build a density estimate that allows the deduction of normals from the voxelized model. This is achieved via a dense packing of information using bitwise arithmetic. We demonstrate t...
متن کاملFPGA Implementation of a Single Pass Real-Time Blob Analysis Using Run Length Encoding
MPC-Workshop February 2008 FPGA Implementation of a Single Pass Real-Time Blob Analysis Using Run Length Encoding J. Trein, A. Th. Schwarzbacher and B. Hoppe Department of Electronic and Computer Science, Hochschule Darmstadt, Germany School of Electronic and Communications Engineering, Dublin Institute of Technology, Ireland * [email protected], + [email protected], ° hoppe@eit....
متن کاملConnected Components of Real Double Bruhat Cells
The main geometric objects of study in this paper are double Bruhat cells G = BuB∩B−vB− in a simply-connected connected complex semisimple group G; here B and B− are two opposite Borel subgroups in G, and u and v any two elements of the Weyl group W . Double Bruhat cells were introduced and studied in [5] as a geometric framework for the study of total positivity in semisimple groups; they are ...
متن کاملStrongly connected components-Algorithm for finding the strongly connected components of a graph
A directed graph G (V, E) is strongly connected if and only if, for any pair of vertices X and Y from V, there exists a path from X to Y and a path from Y to X. In Computer Science, the partition of a graph in strongly connected components is represented by the partition of all vertices from the graph, so that for any two vertices, X and Y, from the same partition, there exists a path from X to...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: EURASIP Journal on Image and Video Processing
سال: 2013
ISSN: 1687-5281
DOI: 10.1186/1687-5281-2013-21